Linear Waste of Best Fit Bin Packing on Skewed Distributions
نویسندگان
چکیده
We prove that Best Fit bin packing has linear waste on the discrete distributionU{j, k} (where items are drawn uniformly from the set {1/k, 2/k, · · · , j/k}) for sufficiently large k when j = αk and 0.66 ≤ α < 2/3. Our results extend to continuous skewed distributions, where items are drawn uniformly on [0, a], for 0.66 ≤ a < 2/3. This implies that the expected asymptotic performance ratio of Best Fit is strictly greater than 1 for these distributions.
منابع مشابه
Divergence-proving Techniques for Best Fit Bin Packing and Random Fit
This work discusses my attempts to extend Kenyon and Mitzenmacher’s technique for proving diveregnce of the online approximation algorithm Best Fit to Random Fit – another approximation algorithm for the well-known NP-hard problem of bin packing. In specific, the paper goes over Kenyon and Mitzenmacher’s recent advances on divergence of the waste of Best Fit bin packing for the skewed distribut...
متن کاملOnline Stochastic Bin Packing
Motivated by the problem of packing Virtual Machines on physical servers in the cloud, we study the problem of one-dimensional online stochastic bin packing. Items with sizes sampled independent and identically (i.i.d.) from a distribution with integral support arrive as a stream and must be packed on arrival in bins of size B, also an integer. The size of an item is known when it arrives and t...
متن کاملA Self Organizing Bin Packing
This paper reports on experiments with a new on-line heuris-tic for one-dimensional bin packing whose average-case behavior is surprisingly robust. We restrict attention to the class of \discrete" distributions , i.e., ones in which the set of possible item sizes is nite (as is commonly the case in practical applications), and in which all sizes and probabilities are rational. It is known from ...
متن کاملA Self Organizing Bin Packing Heuristic
This paper reports on experiments with a new on-line heuris-tic for one-dimensional bin packing whose average-case behavior is surprisingly robust. We restrict attention to the class of \discrete" distributions , i.e., ones in which the set of possible item sizes is nite (as is commonly the case in practical applications), and in which all sizes and probabilities are rational. It is known from ...
متن کاملAverage-Case Analysis of First Fit and Random Fit Bin Packing
We prove that the First Fit bin packing algorithm is stable under the input distribution U {k − 2, k} for all k ≥ 3, settling an open question from the recent survey by Coffman, Garey, and Johnson [3]. Our proof generalizes the multi-dimensional Markov chain analysis used by Kenyon, Rabani, and Sinclair to prove that Best Fit is also stable under these distributions [11]. Our proof is motivated...
متن کامل